Cryptanalysis of an implementation scheme of the Tamed Transformation Method cryptosystem
نویسندگان
چکیده
A Tamed Transformation Method (TTM) cryptosystem was proposed by T.T.Moh in 1999. We describe how the rst implementation scheme of the TTM system can be defeated. The computational complexity of our attack is 2 33 computations on the nite eld with 2 8 elements. 1. Introduction During the last twenty years, public key cryptosystems have been developed to become an important part of our modern communication system. A number of diierent authors have constructed multivariable public key cryptosystems { cryptosystems based on multivariable functions instead of single variable functions. The safety of such systems rely on the diiculty of solving systems of polynomial equations with many variables. Recently, Matsumoto and Imai MI] proposed a method that was later defeated by Patarin in P]. Another method is the Tamed Transformation Method (TTM) proposed by Moh M]. Goubin and Courtois claimed to have defeated this system in CG], but Chen and Moh refuted this claim in CM]. In this article, we use a completely diierent method to show that the implementation scheme suggested in M] and also the ones suggested in CGC] are not secure. Our approach is inspired by the work of Patarin on the Matsumoto-Imai scheme P]. The basic idea of the TTM systems is that it is computationally diicult to decompose com
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملCryptanalysis of a technique to transform discrete logarithm based cryptosystems into identity-based cryptosystems
In this paper we analyse a technique designed to transform any discrete logarithm based cryptosystem into an identity-based cryptosystem. The transformation method is claimed to be efficient and secure and to eliminate the need to invent new identity-based cryptosystems. However, we show that the identity-based cryptosystem created by the proposed transformation method suffers from a number of ...
متن کاملSecurity Analysis and Implementation of an Improved Cch2 Proxy Multi-Signature Scheme
Many of the signature schemes are proposed in which the t out of n threshold schemes are deployed; but they still lack the property of security. In this paper, we have discussed implementation of improved CCH1 and improved CCH2 proxy multi-signature scheme based on elliptic curve cryptosystem. We have represented time complexity, space complexity and computational overhead of improved CCH1 and ...
متن کاملPublic key cryptosystem MST3: cryptanalysis and realization
A new type of public key cryptosystem, called MST3, has been recently introduced on the basis of covers and logarithmic signatures for non-abelian finite groups. The class of Suzuki 2-groups has been proposed for a possible realization of the generic scheme. Due to their simple structure, the groups enable us to study the security of the system and also provide an efficient implementation. An e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003